# computation

• 21Computation of CRC — Computation of a cyclic redundancy check is derived from the mathematics of polynomial division, modulo two. In practice, it resembles long division of the binary message string, with a fixed number of zeroes appended, by the generator polynomial …

Wikipedia

• 22Computation tree logic — Computation tree logic&#160;(CTL) is a branching time logic, meaning that its model of time is a tree like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is&#8230; …

Wikipedia

• 23Computation of actuarial reserves — generally refers to the process of calculating the amount which an insurance company must hold in reserve for expected future liabilities, or Actuarial reserves.The calculation process often involves a number of assumptions, particularly in&#8230; …

Wikipedia

• 24Computation history — In computer science, a computation history is a sequence of steps taken by an abstract machine in the process of computing its result. Computation histories are frequently used in proofs about the capabilities of certain machines, and&#8230; …

Wikipedia

• 25Computation time — In computational complexity theory, computation time is a measure of how many steps are used by some abstract machine in a particular computation. For any given model of abstract machine, the computation time used by that abstract machine is a&#8230; …

Wikipedia

• 26Computation tree — A computation tree is a representation for the computation steps of a non deterministic Turing machine on a specified input. A computation tree is a rooted tree of nodes and edges. Each node in the tree represents a single computational state,&#8230; …

Wikipedia

• 27Computation in the limit — In computability theory, a function is called limit computable if it is the limit of a uniformly computable sequence of functions. The terms computable in the limit and limit recursive are also used. One can think of limit computable functions as …

Wikipedia

• 28computation symbolique — simbolinis skaičiavimas statusas T sritis automatika atitikmenys: angl. symbolic calculus; symbolic computation vok. symbolisches Rechnen, n rus. символьное вычисление, n pranc. calcul symbolique, m; computation symbolique, f …

Automatikos terminų žodynas

• 29Computation Tree Logic — Die Computation Tree Logic (kurz CTL) ist eine Temporale Logik, die speziell zur Spezifikation und Verifikation von Computersystemen dient. Meist wird sie auch mit CTL* bezeichnet. CTL bezeichnet dann eine spezielle Teilmenge der CTL* Formeln.&#8230; …

Deutsch Wikipedia

• 30Computation Tree Logic* — Die Computation Tree Logic (kurz CTL) ist eine Temporale Logik, die speziell zur Spezifikation und Verifikation von Computersystemen dient. Meist wird sie auch mit CTL* bezeichnet. CTL bezeichnet dann eine spezielle Teilmenge der CTL* Formeln.&#8230; …

Deutsch Wikipedia